An on-line graph coloring algorithm with sublinear performance ratio
نویسندگان
چکیده
منابع مشابه
An on-line graph coloring algorithm with sublinear performance ratio
One of the simplest heuristics for obtaining a proper coloring of a graph is the Fii-Fit algorithm: Fix an arbitrary ordering of the vertices and, using the positive integers as the color set, assign to each successive vertex the least integer possible (keeping the coloring proper). This is an example of an on-line algorithm for graph coloring. In the on-line model, a graph is presented one ver...
متن کاملOn-Line Coloring and Recursive Graph Theory
An on-line vertex coloring algorithm receives the vertices of a graph in some externally determined order, and, whenever a new vertex is presented, the algorithm also learns to which of the previously presented vertices the new vertex is adjacent. As each vertex is received, the algorithm must make an irrevocable choice of a color to assign the new vertex, and it makes this choice without knowl...
متن کاملParallel and On-Line Graph Coloring
We discover a surprising connection between graph coloring in two orthogonal paradigms: parallel and on-line computing. We present a randomized on-line coloring algorithm with a performance ratio of O(n= log n), an improvement of p log n factor over the previous best known algorithm of Vishwanathan. Also, from the same principles, we construct a parallel coloring algorithm with the same perform...
متن کاملA practical algorithm for [r, s, t]-coloring of graph
Coloring graphs is one of important and frequently used topics in diverse sciences. In the majority of the articles, it is intended to find a proper bound for vertex coloring, edge coloring or total coloring in the graph. Although it is important to find a proper algorithm for graph coloring, it is hard and time-consuming too. In this paper, a new algorithm for vertex coloring, edge coloring an...
متن کاملAn exact algorithm with learning for the graph coloring problem
Given an undirected graph G=(V ,E), the Graph Coloring Problem (GCP) consists in assigning a color to each vertex of the graph G in such a way that any two adjacent vertices are assigned different colors, and the number of different colors used is minimized. State-of-the-art algorithms generally deal with the explicit constraints in GCP: any two adjacent vertices should be assigned different co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1989
ISSN: 0012-365X
DOI: 10.1016/0012-365x(89)90096-4